Artificial Bee Colony Algorithm to Generator Maintenance Scheduling in Competitive Market

نویسندگان

  • R. Anandhakumar
  • S. Subramanian
  • S. Ganesan
  • Ibrahim El-Amin
  • Jin-Ho Kim
  • Jong-Bae Park
  • Jong-Keun Park
  • Lei Wu
  • Mohammad Shahidehpour
چکیده

This paper proposes an Artificial Bee Colony (ABC) algorithm to Generator Maintenance Scheduling (GMS) in competitive market. In the regulated market the problem of generating optimal maintenance schedules of generating units for the purpose of maximizing economic benefits and improving reliable operation of a power system, subject to satisfying system constraints. In case of deregulated market, the self-governing generation company GENCO prepares GMS aims to maximize their revenue with less consideration on reliability. The Independent System Operator (ISO) receives the maintenance schedules from GENCO and compares with ISO schedules for sanction. This paper proposes an ABC algorithm to solve the GMS in GENCO to maximize their revenue without considering expected renewal cost. Numerical examples on 4 and 32 unit power producers are utilized to demonstrate the effectiveness of the proposed ABC algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

Modelling and Scheduling Lot Streaming Flexible Flow Lines

Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...

متن کامل

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

متن کامل

Design Optimization for Total Volume Reduction of Permanent Magnet Synchronous Generators

Permanent magnet synchronous generators (PMSGs) are novel generators which can be used in high-performance wind farms. High efficiency and flexibility in producing electricity from variable rotation make them good candidate for wind power applications. Furthermore, because these kinds of generators have no excitation winding, there is no copper loss on rotor; hence, they can operate at high pow...

متن کامل

Reliability Constrained DR and Reserve Allocation for Profit based UCP using Artificial Bee Colony Algorithm

The strategy of scheduling generators and reliability management of power system is changing rapidly due to deregulation. Here, generating companies schedule their generators with an objective to maximize their own profit without regarding social benefits. This paper proposes a binary artificial bee colony algorithm (BABC) for solving profit based unit commitment (PBUC) problem, where the requi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011